
#include "tree.h"
#define r p->right
#define l p->left
int main()
{
    NODE *node = new NODE('A'), *p = node;
    node->left = new NODE('B');
    p = l;
    l = new NODE('C');
    p = l;
    r = new NODE('D');
    p = node;
    r = new NODE('E');
    p = r;
    l = new NODE('F');
    p = l;
    r = new NODE('G');
    p = node;
    p = r;
    r = new NODE('H');
    p = r;
    l = new NODE('I');
    r = new NODE('J');
    node->showMid();
    printf("\n");
    node->showRear();
    printf("\n");
    return 0;
}